Vapnik-chervonenkis Density in Some Theories without the Independence Property, I
نویسنده
چکیده
We recast the problem of calculating Vapnik-Chervonenkis (VC) density into one of counting types, and thereby calculate bounds (often optimal) on the VC density for some weakly o-minimal, weakly quasi-o-minimal, and P -minimal theories.
منابع مشابه
Vapnik-Chervonenkis Density in Some Theories without the Independence Property, II
We study the Vapnik-Chervonenkis (VC) density of definable families in certain stable first-order theories. In particular we obtain uniform bounds on VC density of definable families in finite U-rank theories without the finite cover property, and we characterize those abelian groups for which there exist uniform bounds on the VC density of definable families.
متن کاملVapnik-chervonenkis Classes of Definable Sets
We show that a class of subsets of a structure uniformly definable by a first-order formula is a Vapnik-Chervonenkis class if and only if the formula does not have the independence property. Via this connection we obtain several new examples of Vapnik-Chervonenkis classes, including sets of positivity of finitely subanalytic functions.
متن کاملAnnealed Theories of Learning
We study annealed theories of learning boolean functions using a concept class of nite cardinality The naive annealed theory can be used to derive a univer sal learning curve bound for zero temperature learning similar to the inverse square root bound from the Vapnik Chervonenkis theory Tighter nonuniversal learning curve bounds are also derived A more re ned annealed theory leads to still tigh...
متن کاملBoolean Functions: Cryptography and Applications
Abstract. The Vapnik-Chervonenkis (VC) dimension and the Sauer-Shelah lemma have found applications in numerous areas including set theory, combinatorial geometry, graph theory and statistical learning theory. Estimation of the complexity of discrete structures associated with the search space of algorithms often amounts to estimating the cardinality of a simpler class which is effectively indu...
متن کاملOn the VC-dimension and Boolean functions with long runs
The Vapnik-Chervonenkis (VC) dimension and the Sauer-Shelah lemma have found applications in numerous areas including set theory, combinatorial geometry, graph theory and statistical learning theory. Estimation of the complexity of discrete structures associated with the search space of algorithms often amounts to estimating the cardinality of a simpler class which is effectively induced by som...
متن کامل